Capacity and error-exponent for the direct detection photon channel-Part II

نویسنده

  • Aaron D. Wyner
چکیده

The capacity and error exponent of the direct detection optical channel are considered. The channel input in a T-second interval is a waveform A(r), 0 5 t I T, which satisfies 0 I A(t) I A, and (l/r)],,%(t) dt I aA, 0 < IT 11. The channel output is a Poisson process with intensity parameter X(t) + he. ‘The quantities A and CIA represent the peak and average power, respectively, of the optical signal, and X0 represents the “dark current.” In Part I the channel capacity of this channel and a lower bound on the error exponent are calculated. An explicit construction for an exponentially opt imum family of codes is also exhibited. In Part II we obtain an upper bound on the error exponent which coincides with the lower bound. Thus this channel is one of the very few for which the error exponent is known exactly. DEDICATION These papers are dedicated to the memory of Stephen 0. Rice, an extraordinary mentor, supervisor, and friend. He was a master of numerical methods and asymptotics and was very much at home with the nineteenth-century menager ie of special functions. The generous and easy way in which he shared his genius with his col leagues is legendary, and I was fortunate to have been a beneficiary of his advice and expertise during the first decade of my career at Bell Laboratories. As did all of Steve’s colleagues, I learned much from this gentle and talented man. We will remember him always.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Exponents for a Direct Detection Optical Channel

Error exponent bounds for a noise free optical channel using a direct detection receiver are computed for the cases of Pulse Position Modulation (PPM) and for the basic channel with binary output and average intensity constraint. Some consequences are derived regarding the behavior of the interleaving scheme suggested by Massey, the optimality of the PPM format and the significance of the Ro pa...

متن کامل

Strong Converse, Feedback Channel Capacity and Hypothesis Testing

In light of recent results by Verd u and Han on channel capacity, we examine three problems: the strong converse condition to the channel coding theorem, the capacity of arbitrary channels with feedback and the Neyman-Pearson hypothesis testing type-II error exponent. It is rst remarked that the strong converse condition holds if and only if the sequence of normalized channel information densit...

متن کامل

Lower bounds on the quantum capacity and highest error exponent of general memoryless channels

Tradeoffs between the information rate and fidelity of quantum error-correcting codes are discussed. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a general completely positive linear map, where the dimension of the underlying Hilbert space is a prime number. On such a quantum channel, the highest fidelity of a quantum erro...

متن کامل

Blind decoding of Linear Gaussian channels with ISI, capacity, error exponent, universality

A new straightforward universal blind detection algorithm for linear Gaussian channel with ISI is given. A new error exponent is derived, which is better than Gallager’s random coding error exponent.

متن کامل

Venkat Anantharam The Reliability of Communicating Information Through Timing via an Exponential Server

A single server queue can be viewed as a communication channel where information is encoded into the times of arrivals of packets into the queue and needs to be decoded from the departure times. Such channels are of interest in computer security, since their existence provides a way to leak information across security boundaries in a covert way. Anantharam and Verdu (1994) determined that the S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 34  شماره 

صفحات  -

تاریخ انتشار 1988